A Canonical Semi-Deterministic Transducer
نویسندگان
چکیده
We prove the existence of a canonical form for semi-deterministic transducers with sets of pairwise incomparable output strings. Based on this, we develop an algorithm which learns semi-deterministic transducers given access to translation queries. We also prove that there is no learning algorithm for semi-deterministic transducers that uses only domain knowledge.
منابع مشابه
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equivalence of their induced transformations in polynomial time. If the transducer is total, the canonical form can be obtained in polynomial time as well.
متن کاملLearning Monadic Queries for Semi-Structured Documents from Positive Examples
Querying for nodes in trees is a core operation for information extraction from semi-structured documents in XML or HTML. We show that regular monadic queries for nodes in trees can be identified from positive examples, and this in polynomial time when represented by deterministic node selecting transducers that we introduce.
متن کاملMinimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of normalizing transformations which, among others, guarantee that non-trivial output is produced as early as possible. For a deterministic bottom-up transducer where every state produces either none or infinitely many output...
متن کاملA Polynomial-Time Algorithm for Checking the Inclusion of Deterministic Restricted One-Counter Transducers Which Accept by Final State
This paper is concerned with a subclass of deterministic pushdown transducers, called deterministic restricted one-counter transducers (droct’s), and studies the inclusion problem for droct’s which accept by final state. In the previous study, we presented a polynomialtime algorithm for checking the equivalence of these droct’s. By extending this technique, we present a polynomial-time algorith...
متن کاملTowards an algebraic characterization of rational word functions
Introduction In formal language theory, several models characterize regular languages: finite au-tomata, congruences of finite index, monadic second-order logic (MSO), see e.g. [Büc60, Elg61, Tra61]. Further connections exist between monoid varieties and logical fragments of MSO, for instance aperiodic monoids have been shown to recognize exactly the word languages defined by first-order (FO) f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014